Convergence of quasi-Newton matrices generated by the symmetric rank one update
ثبت نشده
چکیده
Quasi-Newton algorithms for unconstrained nonlinear minimization generate a sequence of matrices that can be considered as approximations of the objective function second derivatives. This paper gives conditions under which these approximations can be proved to converge globally to the true Hessian matrix, in the case where the Symmetric Rank One update formula is used. The rate of convergence is also examined and proven to be improving with the rate of convergence of the underlying iterates. The theory is confirmed by some numerical experiments that also show the convergence of the Hessian approximations to be substantially slower for other known quasi-Newton formulae.
منابع مشابه
Convergence of quasi-Newton matrices generated by the symmetric rank one update
Quasi-Newton algorithms for unconstrained nonlinear minimization generate a sequence of matrices that can be considered as approximations of the objective function second derivatives. This paper gives conditions under which these approximations can be proved to converge globally to the true Hessian matrix, in the case where the Symmetric Rank One update formula is used. The rate of convergence ...
متن کاملScaled memoryless symmetric rank one method for large-scale optimization
This paper concerns the memoryless quasi-Newton method, that is precisely the quasi-Newton method for which the approximation to the inverse of Hessian, at each step, is updated from the identity matrix. Hence its search direction can be computed without the storage of matrices. In this paper, a scaled memoryless symmetric rank one (SR1) method for solving large-scale unconstrained optimization...
متن کاملOn Solving Large-scale Limited-memory Quasi-newton Equations
We consider the problem of solving linear systems of equations with limited-memory members of the restricted Broyden class and symmetric rank-one matrices. In this paper, we present various methods for solving these linear systems, and propose a new approach based on a practical implementation of the compact representation for the inverse of these limited-memory matrices. Using the proposed app...
متن کاملA Modified Rank One Update Which Converges Q-Superlinearly
Quasi-Newton methods are generally held to be the most efficient minimization methods for small to medium sized problems. From these the symmetric rank one update of Broyden [4] has been disregarded for a long time because of its potential failure. The work of Conn, Gould and Toint [6], Kelley and Sachs [13] and Khalfan, Byrd and Schnabel [14], [15] has renewed the interest in this method. Howe...
متن کاملRepresentations of quasi-Newton matrices and their use in limited memory methods
We derive compact representations of BFGS and symmetric rank one matrices for optimization These representations allow us to e ciently implement limitedmemory methods for large constrained optimization problems In particular we discuss how to compute projections of limited memory matrices onto subspaces We also present a compact representation of the matrices generated by Broyden s update for s...
متن کامل